Multiparty Homomorphic Encryption from Ring-Learning-with-Errors

Abstract We propose and evaluate a secure-multiparty-computation (MPC) solution in the semi-honest model with dishonest majority that is based on multiparty homomorphic encryption (MHE). To support our solution, we introduce version of Brakerski-Fan-Vercauteren cryptosystem implement it an open-source library. MHE-based MPC solutions have several advantages: Their transcript public, their o~ine phase compact, circuit-evaluation procedure noninteractive. By exploiting these properties, communication complexity tasks reduced from quadratic to linear number parties, thus enabling secure computation among potentially thousands parties broad variety computing paradigms, traditional peer-to-peer setting cloud-outsourcing smart-contract technologies. approaches can also outperform state-of-the-art solutions, even for small parties. demonstrate this three circuits: private input selection application private-information retrieval, component-wise vector multiplication private-set intersection, Beaver triples generation . For first circuit, privately selecting one eight thousand parties’ (of 32 KB each) requires only 1.31 MB per party completes 61.7 seconds. second circuit approach 8.6 times faster 39.3 less than current methods. third ten generates 20 more while requiring 136 per-triple oblivious transfer. implemented scheme Lattigo library open-sourced code at github.com/ldsec/lattigo.